Platform Dependent Verification: On Engineering Verification Tools for 21st Century

The paper overviews recent developments in platform-dependent explicit-state LTL model checking.Comment: In Proceedings PDMC 2011, arXiv:1111.006

Syntactical Rules for Colored Petri Nets Manipulation

National audienceDefining structural analysis techniques for colored Petri nets or generalizing existing techniques of ordinary nets to colored nets is made difficult by the management of the color mappings of the net. Indeed, the structure of the colored net does not necessarily reflect the one of the underlying net. A solution is to unfold the net and work directly on the unfolded net. Another one is to work directly on the colored net in a symbolic way. We explore in this work a symbolic framework based on constraints systems. A class of colored Petri nets is defined. We define simple rules to translate each color mapping allowed by this class into an equivalent constraints system. At last we work at a syntactical level to check properties of mappings. Two relevant examples of application are given

Méthodes et outils de vérification pour les réseaux de Petri de haut niveau (Application à la vérification de programmes Ada concurrents)

Cette thèse s'inscrit dans le cadre de la vérification automatique de programmes concurrents basée sur un modèle formel intermédiaire, les réseaux de Petri colorés. Nous nous attachons particulièrement à définir, ou adapter, des méthodes qui visent à lutter contre le phénomène d'explosion combinatoire induit par les algorithmes d'exploration du graphe d'accessibilité. Nous oeuvrons pour cela à deux niveaux : au niveau structurel, par des techniques d'abstraction du modèle, et au niveau sémantique, par des techniques de réduction du graphe d'accessibilité du système. Afin de valider l'intérêt pratique des techniques proposées nous les avons implantées dans deux outils : Helena un model checker pour les réseaux de Petri de haut niveau et Quasar une plate-forme pour la validation de programmes Ada concurrents.This thesis enters in the frame of the automatic verification of concurrent software based on an intermediary formal language, colored Petri nets. We particularly endeavor to define, or adapt, methods which aim at tackling the state explosion induced by an exhaustive exploration of the state space. We work at two levels : at a structural level, by defining some automatic automatic abstraction rules of the model, and at a semantic level, by reducing the reachabiblity graph of the system. In order to validate the practical interest of the proposed techniques we implemented them in two tools: Helena a model checker for high level Petri nets and Quasar, a platform for the verification of concurrent Ada software.PARIS-CNAM (751032301) / SudocSudocFranceF

Memory Efficient State Space Storage in Explicit Software Model Checking

noteresum

Some Solutions to the Ignoring Problem

Abstract. The ignoring problem refers to the fact that some actions may be infinitely postponed by a state space search algorithm that makes use of partial order reduction (POR). The prevention of this phenomenon is mandatory if one wants to verify more elaborate properties than the deadlock freeness, e.g., safety or liveness properties. We present in this work some solutions to this problem. In order to assess the quality of our propositions, we included them in our model checker Helena. We report the result of some experiments which show that our algorithms yield better reductions than state of the art algorithms like those implemented in the Spin tool

A Semi-Explicit Method to Store State Spaces in a Compact Way

National audienceThe limited amount of memory is the major bottleneck in model checkingtools and algorithms based on an explicit states enumeration. Thus,techniques which allow to represent the states efficiently areprecious for these tools. We present in this work a novel approachwhich enables to store the state space in a compact way. Though itbelongs to the family of explicit storage methods, we qualify it assemi-explicit since states may not be explicitly represented in the statespace. Experiments show that very compact representations areobtained, with an acceptable increase of the run time

State Compression Based on One-Sided Communications for Distributed Model Checking

International audienc

One-Sided Communications for More Efficient Parallel State Space Exploration over RDMA Clusters

International audienc